红黑树的java实现，包括插入节点，删除节点，查找等操作。附测试文件。-An implementation for RBtree

红黑树的JAVA实现。红黑树仍然不是平衡树，但是统计性能要好于AVL树。要保持红黑树的规则，主要通过两类操作，一类是换色，一类还是旋转。-JAVA red-black tree implementation. Red-black tree is still not balanced tree, but the statistical performance is better than the AVL tree. Red-black tree to keep the rules, mainly

A Java implementation of Red-Black Tree algorithm for key storage ( here the keys are simply numbers )

Java 实现的红黑树，拥有添加删除修改排序等功能-Red black tree in Java